Polynomial cost for solving IVP for high-index DAE
نویسندگان
چکیده
منابع مشابه
Polynomial Cost for Solving IVP for High-Index DAE
We show that the cost of solving initial value problems for high-index differential algebraic equations is polynomial in the number of digits of accuracy requested. The algorithm analysed is built on a Taylor series method developed by Pryce for solving a general class of differential algebraic equations. The problem may be fully implicit, of arbitrarily high fixed index and contain derivatives...
متن کاملStructural analysis of high-index DAE for process simulation
Abstract. This paper deals with the structural analysis problem of dynamic lumped process high-index DAEmodels. We consider two methods for index reduction of such models by differentiation: Pryce’s method and the symbolic differential elimination algorithm rifsimp. Discussion and comparison of these methods are given via a class of fundamental process simulation examples. In particular, the ef...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولNon-polynomial Spline Method for Solving Coupled Burgers Equations
In this paper, non-polynomial spline method for solving Coupled Burgers Equations are presented. We take a new spline function. The stability analysis using Von-Neumann technique shows the scheme is unconditionally stable. To test accuracy the error norms 2L, L are computed and give two examples to illustrate the sufficiency of the method for solving such nonlinear partial differential equation...
متن کاملStrategies for solving index one DAE with non-negative constraints: Application to liquid-liquid extraction
Liquid-liquid extraction modeling leads to solve an index one DAE system. For the sake of robustness, it is desirable to account for non-negative constraints. Based on the DASSL architecture (a classical index one DAE solver) we propose and compare three different strategies to implement these bound constraints. Each of these strategies corresponds to a different Newton modification: clipping, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2008
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-008-0163-2